David George Watt

Proof of George Andrews's and David Robbins's q-TSPP Conjecture

1 Proemium In the historical conference Combinatoire Énumerative that took place at the end of May 1985 in Montréal, Richard Stanley raised some intriguing problems about the enumeration of plane partitions (see below), which he later expanded into a fascinating article [11]. Most of these problems concerned the enumeration of “symmetry classes” of plane partitions that were discussed in more d...

A PROOF OF GEORGE ANDREWS’ AND DAVID ROBBINS’ q-TSPP CONJECTURE

The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product-formula, has been stated independently by George Andrews and David Robbins around 1983. We present a proof of this long-standing conjecture.

Edited by DALE PURVES GEORGE J . AUGUSTINE DAVID FITZPATRICK WILLIAM C . HALL ANTHONY - SAMUEL

George

not much worried whether they be right or wrong. His desire to be the center of attraction may lead him to do things considered irrational when viewed from other angles. If he is in the upper 10 per cent of his class at school, it might be well to advance him to the next grade, provided he is sufficiently interested to show that he is capable of doing the work. If convenient, the teacher should...

George Kachergis: George Kachergis Doctoral Dissertation

Language acquisition is a ubiquitous, challenging problem involving fundamental cognitive abilities of attention, learning, and memory. From infants to adult travelers, language learners are faced with figuring out which words refer to which referents from situations that contain many words and referents. By remembering the words and referents (e.g., objects) that co-occur most frequently over ...